A new generalized upper-bound solution for the ECAE process
نویسندگان
چکیده
منابع مشابه
A generalized upper bound solution for bimetallic rod extrusion through arbitrarily curved dies
In this paper, an upper bound approach is used to analyze the extrusion process of bimetallic rods through arbitrarily curved dies. Based on a spherical velocity field, internal, shearing and frictional power terms are calculated. The developed upper bound solution is used for calculating the extrusion force for two types of die shapes: a conical die as a linear die profile and a streamlined di...
متن کاملAn Upper Bound Solution for Analysis of Twist Extrusion Process with Elliptical Die Cross-section
Twist extrusion process is a rather new route to produce highly strained materials. In this process, severe plastic deformation is applied by large shear strains. In current article, required energy for twist extrusion by use of admissible velocity field together with the upper bound technique is predicted. The proposed model is capable of considering the effect of various parameters such as di...
متن کاملan investigation in the deformation zone of the ecae process by the upper bound theorem
in the present paper, the deformation zone of the ecae (equal channel angular extrusion) process was investigated using the upper bound theorem. for this purpose, the shape of the streamlines in the deformation zone was assumed to be cubic bezier curves. then, the force required for the ecae process was optimized with regard to the parameters defining the shape of streamlines by the upper bound...
متن کاملNew Generalized Upper Trace Bound for the Solution of the Lyapunov Equation
A new upper trace bound, which generalizes the best available similar estimates, improves their tightness and holds under a less conservative validity restriction imposed on the coefficient matrix, is derived for the solution matrix of the continuous algebraic Lyapunov equation (CALE). Two numerical examples illustrate the applicability of the main result.
متن کاملA Distributed Solution Protocol that Computes an Upper Bound for the Generalized Mutual Assignment Problem
The generalized mutual assignment problem (GMAP) is the combinatorial optimization (maximization) problem that can describe various distributed problem solving tasks. Recently, we have presented a communication protocol for this problem that enables the agents to find a feasible solution along with a lower bound. This paper provides a new protocol, called DisLRPU , where the agents are engaged ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Journal of Advanced Manufacturing Technology
سال: 2009
ISSN: 0268-3768,1433-3015
DOI: 10.1007/s00170-009-2103-y